Eynard–Mehta Theorem, Schur Process, and their Pfaffian Analogs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

α-Pfaffian, pfaffian point process and shifted Schur measure

For any complex number α and any even-size skew-symmetric matrix B, we define a generalization pf α (B) of the pfaffian pf(B) which we call the α-pfaffian. The α-pfaffian is a pfaffian analogue of the α-determinant studied in [ST] and [V]. It gives the pfaffian at α = −1. We give some formulas for α-pfaffians and study the positivity. Further we define point processes determined by the α-pfaffi...

متن کامل

Eynard - Mehta Theorem , Schur Process

We give simple linear algebraic proofs of Eynard-Mehta theorem, Okoun-kov-Reshetikhin formula for the correlation kernel of the Schur process, and Pfaffian analogs of these results. We also discuss certain general properties of the spaces of all determinantal and Pfaffian processes on a given finite set.

متن کامل

Motzkin Number Pfaffian (theorem 2)

Evaluate the Pfaffian Pfa i, j 1i, j2 n where ai, j j i Mi j 3 with Mn denoting the Motzkin numbers: Mn k0 n 1 k1 n 2 k 2 k k. The evaluation of this Pfaffian was conjectured in the paper "Pfaffian decomposition and a Pfaffian analogue of q-Catalan Hankel determinants'' Now we guess an implicit description (linear recurrences) for the auxiliary function c 2 n,i. We set the option AdditionalEqua...

متن کامل

The Schur–zassenhaus Theorem

When N is a normal subgroup of G, can we reconstruct G from N and G/N? In general, no. For instance, the groups Z/(p2) and Z/(p) × Z/(p) (for prime p) are nonisomorphic, but each has a cyclic subgroup of order p and the quotient by it also has order p. As another example, the nonisomorphic groups Z/(2p) and Dp (for odd prime p) have a normal subgroup that is cyclic of order p, whose quotient is...

متن کامل

Note on the Pfaffian Matrix-Tree Theorem

SCOTT HIRSCHMAN AND VICTOR REINER Kir ho 's elebrated Matrix-Tree Theorem gives a determinant ounting spanning trees in a graph. It has at least three di erent well-known proofs: one via the Binet-Cau hy Theorem (see e.g. [5, x2.2℄), one via a deletionontra tion indu tion (see e.g. [2, x13.2℄), and one due to Chaiken [1℄ via a sign-reversing involution. Re ently Masbaum and Vaintrob [3℄ proved ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Physics

سال: 2005

ISSN: 0022-4715,1572-9613

DOI: 10.1007/s10955-005-7583-z